Inexact solution of NLP subproblems in MINLP
نویسندگان
چکیده
منابع مشابه
Inexact solution of NLP subproblems in MINLP
In the context of convex mixed integer nonlinear programming (MINLP), we investigate how the outer approximation method and the generalized Benders decomposition method are affected when the respective nonlinear programming (NLP) subproblems are solved inexactly. We show that the cuts in the corresponding master problems can be changed to incorporate the inexact residuals, still rendering equiv...
متن کاملProximal methods for nonlinear programming: double regularization and inexact subproblems
This paper describes the first phase of a project attempting to construct an efficient general-purpose nonlinear optimizer using an augmented Lagrangian outer loop with a relative error criterion, and an inner loop employing a state-of-the art conjugate gradient solver. The outer loop can also employ double regularized proximal kernels, a fairly recent theoretical development that leads to full...
متن کاملParallel Solution of Disjunctive Minlp Problems
This system combines the demands of process engineering optimization problems with the potential CPU-power of the computers connected to the Internet. The system is capable of using an arbitrary number of computers connected to the Internet for distributed solution of rigorous industrial optimization problems.
متن کاملA Truncated SQP Method Based on Inexact Interior-Point Solutions of Subproblems
We consider sequential quadratic programming (SQP) methods applied to optimization problems with nonlinear equality constraints and simple bounds. In particular, we propose and analyze a truncated SQP algorithm in which subproblems are solved approximately by an infeasible predictor-corrector interior-point method, followed by setting to zero some variables and some multipliers so that compleme...
متن کاملError bounds for proximal point subproblems and associated inexact proximal point algorithms
We study various error measures for approximate solution of proximal point regularizations of the variational inequality problem, and of the closely related problem of finding a zero of a maximal monotone operator. A new merit function is proposed for proximal point subproblems associated with the latter. This merit function is based on Burachik-Iusem-Svaiter’s concept of ε-enlargement of a max...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2012
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-012-0010-5